A Versatile and Efficient GPU Data Structure for Spatial Indexing
نویسندگان
چکیده
منابع مشابه
Indexing Structure For Handling Uncertain Spatial Data
Consideration of uncertainty in manipulation and management of spatial data is important. Unlike traditional fuzzy approaches, in this paper we use a probability-based method to model and index uncertain data in the application of Mojave desert endangered species protection. The query is a feature vector describing the habitat for certain species, and we are interested in finding geographic loc...
متن کاملA Self-adjusting Indexing Structure for Spatial Data
This paper introduces a spatial indexing structure that adjusts itself so as to provide faster access to spatially referenced data most in demand. The structure is a hybrid of a splay tree and a quadtree. The quadtree is a well-known spatial data structure that successively segments a spatial data area into quadrants, preserving the spatial arrangement of the data. Access to data is based on a ...
متن کاملGPU LSM: A Dynamic Dictionary Data Structure for the GPU
We develop a dynamic dictionary data structure for the GPU, supporting fast insertions and deletions, based on the Log Structured Merge tree (LSM). Our implementation on an NVIDIA K40c GPU has an average update (insertion or deletion) rate of 225 M elements/s, 13.5x faster than merging items into a sorted array. The GPU LSM supports the retrieval operations of lookup, count, and range query ope...
متن کاملGPU-based Spatial Indexing and Query Processing Using R-Trees
R-trees are popular spatial indexing techniques that have been widely used in many geospatial applications. The increasingly available Graphics Processing Units (GPUs) for general computing have attracted considerable research interests in applying the massive data parallel technologies to index and query geospatial data based on R-trees. In this paper, we investigate on the potential of accele...
متن کاملYet Another Spatial Indexing Structure
Large data sets of high dimensional objects have become important in applications such as image databases. We present a new hierarchical spatial indexing structure in this paper called the PK-tree, which provides eecient queries, low space overhead and eecient updates. There is a more declarative nature to the deenition of the PK-tree which results in a structure that is unique for a given set ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Visualization and Computer Graphics
سال: 2017
ISSN: 1077-2626
DOI: 10.1109/tvcg.2016.2599043